Randomness, lowness and degrees
نویسندگان
چکیده
منابع مشابه
Randomness, lowness and degrees
We say that A ≤LR B if every B-random number isA-random. Intuitively this means that if oracle A can identify some patterns on some real !, oracle B can also find patterns on !. In other words, B is at least as good as A for this purpose. We study the structure of the LR degrees globally and locally (i.e., restricted to the computably enumerable degrees) and their relationship with the Turing d...
متن کاملComputational Randomness and Lowness
We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterization of these sets and show that they all have Turing degree incomparable to 0 0. This contrasts with a result of Ku cera and Terwijn 5] on sets that are low for the class of Martin-LL of random reals. The Cantor space 2 ! is the set of innnite binar...
متن کاملLowness properties and randomness
The set A is low for (Martin-Löf) randomness if each random set is already random relative to A. A is K-trivial if the prefix complexity K of each initial segment of A is minimal, namely ∀n K(A!n)"K(n) + O(1). We show that these classes coincide. This answers a question of Ambos-Spies and Kučera in: P. Cholak, S. Lempp, M. Lerman, R. Shore, (Eds.), Computability Theory and Its Applications: Cur...
متن کاملAlgorithmic randomness and lowness
We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterization of these sets and show that they all have Turing degree incomparable to 0 0. This contrasts with a result of Ku cera and Terwijn 2] on sets that are low for the class of Martin-LL of random reals. The Cantor space 2 ! is the set of innnite binar...
متن کاملLowness for Demuth Randomness
We show that every real low for Demuth randomness is of hyperimmune-free degree.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2008
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1208359060